<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    109. Convert Sorted List to Binary Search Tree
   </h1>
   <p>
    Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
   </p>
   <p>
    For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of
    <em>
     every
    </em>
    node never differ by more than 1.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5
</pre>
  </div>
  <div>
   <h1 class="question_title">
    109. 有序链表转换二叉搜索树
   </h1>
   <p>
    给定一个单链表，其中的元素按升序排序，将其转换为高度平衡的二叉搜索树。
   </p>
   <p>
    本题中，一个高度平衡二叉树是指一个二叉树
    <em>
     每个节点&nbsp;
    </em>
    的左右两个子树的高度差的绝对值不超过 1。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre>给定的有序链表： [-10, -3, 0, 5, 9],

一个可能的答案是：[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树：

      0
     / \
   -3   9
   /   /
 -10  5
</pre>
  </div>
 </body>
</html>